A parametric representation of totally mixed Nash equilibria
نویسندگان
چکیده
We compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with pre-fixed structure. Using this representation, we show conditions under which a game has the maximum possible number of this kind of equilibria. Then, we present a symbolic procedure that allows us to describe and estimate the number of isolated totally mixed Nash equilibria of an arbitrary game. Under certain assumptions, the algorithm computes the exact number of these equilibria.
منابع مشابه
Universality of Nash Equilibria by Ruchira
Every real algebraic variety is isomorphic to the set of totally mixed Nash equilibria of some three-person game, and also to the set of totally mixed Nash equilibria of an N-person game in which each player has two pure strategies. From the Nash-Tognoli Theorem it follows that every compact differentiable manifold can be encoded as the set of totally mixed Nash equilibria of some game. Moreove...
متن کاملPerfect and Proper Refinements of All Extreme Nash Equilibria for Bimatrix Games
In previous work, bimatrix games were expressed as parametric linear mixed 0− 1 programs and the EχMIP algorithm was proposed to enumerate all their extreme Nash equilibria. In this paper, we use a maximal cliques enumeration algorithm to enumerate all Nash maximal subsets. We use a pair of linear programs in order to identify perfect extreme equilibria and enumerate all Selten maximal subsets....
متن کاملThe effects of payoff magnitude and heterogeneity on behavior in 2×2 games with unique mixed strategy equilibria
The Logit version of Quantal Response Equilibrium (QRE) predicts that equilibrium behavior in games will vary systematically with payoff magnitudes, if all other factors are held constant (including the Nash equilibria of the game). We explore this in the context of a set of asymmetric 2×2 games with unique totally mixed strategy equilibria. The data provide little support for the payoff magnit...
متن کاملThe Complexity of Games on Highly Regular Graphs
We present algorithms and complexity results for the problem of finding equilibria (mixed Nash equilibria, pure Nash equilibria and correlated equilibria) in games with extremely succinct description that are defined on highly regular graphs such as the d-dimensional grid; we argue that such games are of interest in the modelling of large systems of interacting agents. We show that mixed Nash e...
متن کاملOn Sparse Discretization for Graphical Games
This short paper concerns discretization schemes for representing and computing approximate Nash equilibria, with emphasis on graphical games, but briefly touching on normal-form and poly-matrix games. The main technical contribution is a representation theorem that informally states that to account for every exact Nash equilibrium using a nearby approximate Nash equilibrium on a grid over mixe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Mathematics with Applications
دوره 58 شماره
صفحات -
تاریخ انتشار 2009